Trace and Testing Metrics on Nondeterministic Probabilistic Processes
نویسندگان
چکیده
منابع مشابه
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
One of the most studied extensions of testing theory to nondeterministic and probabilistic processes yields unrealistic probabilities estimations that give rise to two anomalies. First, probabilistic testing equivalence does not imply probabilistic trace equivalence. Second, probabilistic testing equivalence differentiates processes that perform the same sequence of actions with the same probab...
متن کاملTesting and Refinement for Nondeterministic and Probabilistic Processes
Transition systems are a basic semantic model for formal description , speciication, and analysis of concurrent and distributed systems. In order to describe and analyze aspects of reliability, such as the likelihood of trace and failure, this model has been extended in various ways to handle probabilistic behavior. To use these models for specii-cation and stepwise development of systems, it i...
متن کاملModal Decomposition on Nondeterministic Probabilistic Processes
We propose a SOS-based method for decomposing modal formulae for nondeterministic probabilistic processes. The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from its decomposition. By our decomposition, we obtain (pre)congruence formats for probabilistic bisimilarity, ready similarity and similari...
متن کاملTrace and Testing Equivalence on Asynchronous Processes
We study trace and may-testing equivalences in the asynchronous versions of CCS and-calculus. We start from the operational deenition of the may-testing preorder and provide for it nitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also touch upon two variants of this theory, by rst considering a more demanding equivalence notion (must-...
متن کاملRemarks on Testing Probabilistic Processes
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the process calculus CSP. We examine the algebraic theory of probabilistic testing, and show that many of the axioms of standard testing are no longer valid in our probabilistic setting; e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.276.4